go/types.graphNode.pred (field)

8 uses

	go/types (current package)
		initorder.go#L46: 			for p := range n.pred {
		initorder.go#L92: 		for p := range n.pred {
		initorder.go#L183: 	pred, succ nodeSet    // consumers and dependencies of this node (lazily initialized)
		initorder.go#L191: 	return len(n.pred) * len(n.succ)
		initorder.go#L226: 				d.pred.add(n)
		initorder.go#L256: 		for p := range n.pred {
		initorder.go#L265: 						s.pred.add(p)
		initorder.go#L272: 			delete(s.pred, n) // remove edge to n